Three-phase optimal power flow for networked microgrids based on semidefinite programming convex relaxation
نویسندگان
چکیده
Many autonomous microgrids have high penetration of distributed generation (DG) units. Optimal power flow (OPF) is necessary for the optimal dispatch such networked (NMGs). Existing convex relaxation methods three-phase OPF are only applicable to radial networks, not meshed networks. To overcome this limitation, we develop a semidefinite programming (SDP) model, which can be applied networks and also includes model DG units on-load voltage regulators with different connection types. The proposed has higher accuracy than other existing models SDP effectively solves problem satisfactory accuracy, as validated by real 6-bus, 9-bus, 30-bus NMGs IEEE 123-bus test cases. In symmetric-component shown more accurate that modelled three single-phase in unbalanced OPF. control variables obtained from optimization used both final strategy initial value non-convex obtain globally solution efficiently.
منابع مشابه
Analysis of Semidefinite Programming Relaxation of Optimal Power Flow for Cyclic Networks
The optimal power flow (OPF) problem determines an optimal operating point of the power network that minimizes a certain objective function subject to physical and network constraints. There has been a great deal of attention in convex relaxation of the OPF problem in recent years, and it has been shown that a semidefinite programming (SDP) relaxation can solve different classes of the nonconve...
متن کاملapplication of upfc based on svpwm for power quality improvement
در سالهای اخیر،اختلالات کیفیت توان مهمترین موضوع می باشد که محققان زیادی را برای پیدا کردن راه حلی برای حل آن علاقه مند ساخته است.امروزه کیفیت توان در سیستم قدرت برای مراکز صنعتی،تجاری وکاربردهای بیمارستانی مسئله مهمی می باشد.مشکل ولتاژمثل شرایط افت ولتاژواضافه جریان ناشی از اتصال کوتاه مدار یا وقوع خطا در سیستم بیشتر مورد توجه می باشد. برای مطالعه افت ولتاژ واضافه جریان،محققان زیادی کار کرده ...
15 صفحه اولConvex Relaxation of Optimal Power Flow - Part II: Exactness
This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations in each model, and proves equivalence relations among them. Part II presents sufficient conditions under which the convex relaxations are exact. Citation: I...
متن کاملSemidefinite relaxation for dominating set
‎It is a well-known fact that finding a minimum dominating set and consequently the domination number of a general graph is an NP-complete problem‎. ‎In this paper‎, ‎we first model it as a nonlinear binary optimization problem and then extract two closely related semidefinite relaxations‎. ‎For each of these relaxations‎, ‎different rounding algorithm is exp...
متن کاملConvex Perturbations for Scalable Semidefinite Programming
Many important machine learning problems are modeled and solved via semidefinite programs; examples include metric learning, nonlinear embedding, and certain clustering problems. Often, off-the-shelf software is invoked for the associated optimization, which can be inappropriate due to excessive computational and storage requirements. In this paper, we introduce the use of convex perturbations ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Energy
سال: 2022
ISSN: ['0306-2619', '1872-9118']
DOI: https://doi.org/10.1016/j.apenergy.2021.117771